Parameterized fairness axioms on cycle-free graph games
نویسندگان
چکیده
منابع مشابه
Parameterized fairness axioms on cycle-free graph games
We study cooperative transferable utility games with a communication structure represented by an undirected graph, i.e., a group of players can cooperate only if they are connected on the graph. This type of games is called graph games and the best-known solution for them is the Myerson value, which is characterized by the component efficiency axiom and the fairness axiom. Recently the average ...
متن کاملThe Component Fairness Solution for Cycle-free Graph Games
In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new single-valued solution concept, the component fairness solution. Our solution is characterized by component ef...
متن کاملThe average tree solution for cycle-free graph games
In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph. We introduce a new single-valued solution concept, the average tree solution. Our solution is characterized by component efficiency and component fairness. The interpretatio...
متن کاملTree-type values for cycle-free directed graph games
For arbitrary cycle-free directed graph games tree-type values are introduced axiomatically and their explicit formula representation is provided. These values may be considered as natural extensions of the tree and sink values as has been defined correspondingly for rooted and sink forest graph games. The main property for the tree value is that every player in the game receives the worth of t...
متن کاملFairness and the Axioms of Control Predicates @bullet Fairness and the Axioms of Control Predicates
Many recent axiomatic definitions for structured programming languages include control predicates, which are an abstraction of location counters. The usual axioms identify control locations so as to imply that "no time" is needed to pass from the end of one statement to the next, and in particular from the end of a loop body back to the test at the head of the loop. Although this is reasonable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2011
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-011-9761-7